“Papers of School of Computer Science”
Pages:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
1. M. Nouri and M. Ghodsi,
Probabilistic Parallel Scheduling of Complex DAGs by Unreliable Workers,
Algorithmica (to appear) [abstract]
2. M. Kargar and M. Ghodsi,
Truthful and Secure Routing in Ad Hoc Networks,
International Journal of Security and its Applications (to appear) [abstract]
3. S. Shirali-Shahraza, S. Hassas Yeganeh, H. Abbolhassani and J. Habibi,
Circluster: Storing Cluster Shapes for Clustering,
(to appear) [abstract]
4. M. H. Farahabadi and H. Sarbazi-Azad,
On the Hamiltonian properties of OTIS networks,
in: , , 2009, pp. [abstract]
5. S. Meraji, A. Nayebi and H. Sarbazi-Azad,
Performance evaluation of adaptive wormhole routing in necklace hypercubes,
in: , , 2009, pp. [abstract]
6. P. Shareghi and H. Sarbazi-Azad,
The stretched network: properties, routing, and performance,
Journal of Information Science and Engineering (to appear) [abstract]
7. N. Imani, H. Sarbazi-Azad and A. Zomaya,
Intruder capturing in mesh and torus networks,
International Journal on Foundations of Computer Science (to appear) [abstract]
8. N. Imani, H. Sarbazi-Azad, A. Zomaya and P. Moinzadeh,
Detecting threats in star graphs,
IEEE Transactions on Parallel and Distributed Systems 20(2009), 474-483 [abstract]
9. A. Nayebi and H. Sarbazi-Azad,
Analysis of k-neigh topology control protocol for mobile wireless networks,
Computer Networks (to appear) [abstract]
10. H. Mirzaei, S. Ahmadian, S. Mahabadi, M. Sadeghi, C. Eslahchi and H. Pezeshk,
An algorithm for construction of all perfect phylogeny matrices,
MATCH Communication in Methematical and in Computer Chemistry (to appear) [abstract]
back to top
Pages:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
